Multi-Floor Facility Layout Optimization Using Slicing Tree Structure

نویسندگان

  • Takao KOIKE
  • Hiromichi ICHIKAWA
  • Kazuho YOSHIMOTO
چکیده

This paper presents an algorithm for solving a multi-floor facility layout problem. The most apparent difference and also the potential difficulty in a multi-floor facility layout problem, compared to a single floor facility layout problem, are the problems regarding the placement of the vertical transportation equipments (elevators), which are to be used for vertical transportation occuring within the facility. Many solutions generated by algorithms presented for the multiple floor layout problems in the past had problems : irregular-shaped workshops and/or unnecessarily large unusable space (=dead space) within the facility. In this paper, we implement and improve Slicing Tree Structure for generating layout. Layout generated by using Slicing Tree Structure has a unique characteristic of making no dead spaces within the facility at all. We will present an algorithm, which generates near-optimal layout of workshops and elevators in a facility without dead space by improving the structure of Slicing Tree.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Optimization via Invasive Weeds Algorithm for Dynamic Facility Layout Problem

The dynamic facility layout problem (DFLP) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. In this paper a new optimization algorithm inspired from colonizing weeds, Invasi...

متن کامل

Tree Structure Modeling and Genetic Algorithm-based Approach to Unequal-area Facility Layout Problem

A tree structure model has been proposed for representing the unequal-area facility layout. Each facility has a different rectangular shape specified by its area and aspect ratio. In this layout problem, based on the assumption that the shop floor has enough space for laying out the facilities, no constraint is considered for a shop floor. Objectives are minimizing total part movement between f...

متن کامل

A non dominated ranking Multi Objective Genetic Algorithm and electre method for unequal area facility layout problems

The unequal area facility layout problem (UA-FLP) comprises a class of extremely difficult and widely applicable optimization problems arising in diverse areas and meeting the requirements for real-world applications. Genetic Algorithms (GAs) have recently proven their effectiveness in finding (sub) optimal solutions to many NP-hard problems such as UA-FLP. A main issue in such approach is rela...

متن کامل

A two-stage mathematical-programming method for the multi-floor facility layout problem

The purpose of this research paper is to present a three-stage method using mathematicalprogramming techniques that finds high-quality solutions to the multi-floor facility layout problem. The first stage is a linear mixed-integer program that assigns departments to floors such that the total of the departmental interaction costs between floors is globally minimized. Subsequent stages find a lo...

متن کامل

Strategic Layout Planning and Simulation for Lean Manufacturing a Layopt™ Tutorial

LayOPTTM is an innovative facilities layout analysis and optimization software package which can be used by layout planners and engineers in the optimal solution of single and multiple floor facility layout problems. LayOPT is ideal for the re-design of the overall layout for an existing facility or the development of a block layout for a new building. It can be applied to manufacturing, wareho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010